A High-Speed Parallel Architecture for Stereo Matching
نویسندگان
چکیده
The stereo matching algorithm based on the belief propagation (BP) has the low matching error as the global method, but has the disadvantage of a long processing time. In addition to a low error of less than 2.6% in the Middlebury image simulation, a new architecture based on BP shows a high-speed parallel VLSI structure of the time complexity O(N), at properly small iterations, so that it can be useful as a chip in the real-time application like robots and navigations.
منابع مشابه
Fast Visual Hull and Stereo Matching on Cuda
Stereo matching and visual hull are techniques that are often used in 3D reconstruction. This paper presents and evaluates implementations of these algorithms on the GPU using the CUDA architecture. Experimental results show that both, visual hull and stereo matching, have much to gain in terms of speed from the data parallel execution model.
متن کاملOptimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملA parallel algorithm for incremental stereo matching on SIMD machines
Previous matching algorithms have achieved high speeds through algorithm simplification and/or relied on custom hardware. The objective of our work has been the development a robust high-speed stereo matcher by exploiting parallel algorithms executing on general purpose SIMD machines. Our approach is based on several existing techniques dealing with the classification and evaluation of matches,...
متن کاملImage Synthesis and Occlusion Removal of Intermediate Views by Stereo Matching
We suggest an efficient real-time method for removing occlusions when synthesizing intermediate views from two stereo images by stereo matching algorithm. The proposed method can carry out the correction of noise resulting from stereo matching, removal of occlusions to achieve high fidelity rendering, and parallel computing to achieve realtime synthesis. The proposed algorithm is compared with ...
متن کاملFast Parallel Image Matching Algorithm on Cluster
This paper introduces our experiences with developing fast Parallel stereo matching algorithm on Cluster. The key technique of generating DEMs or DSMs’ from remote-sensing images is stereo matching, and it’s one of the most time consuming algorithms, so that many efforts have been carried out to develop fast algorithms. Many difficulty problems continue to challenge researchers in this field; t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006